Queueing systems with pre-scheduled random arrivals
نویسندگان
چکیده
منابع مشابه
Queueing systems with pre-scheduled random arrivals
We consider a point process i + ξi, where i ∈ Z and the ξi’s are i.i.d. random variables with variance σ. This process, with a suitable rescaling of the distribution of ξi’s, converges to the Poisson process in total variation for large σ. We then study a simple queueing system with our process as arrival process, and we provide a complete analytical description of the system. Although the arri...
متن کاملQueueing system with pre-scheduled random arrivals
We consider a point process obtained summing to each point i of the set of the integer Z an i.i.d random variable ξi having a variance that can be also much larger than 1. We compare the process obtained with this construction with the standard Poisson process, and we show that in some sense our process tends to converge for large variance of ξ to the Poisson process in total variation. We then...
متن کاملInfinite-Server Queueing Tandem With MMPP Arrivals And Random Capacity Of Customers
Tandem of two queueing systems with infinite number of servers is considered. Customers arrive at the first stage of the tandem according to Markovian modulated Poisson process, and after a completion of their services, they go to the second stage. Each customer carries some data package with a random value (capacity of the customer). Service time does not depend on the customers’ capacities in...
متن کاملStrategic Arrivals into Queueing Networks: The Network Concert Queueing Game
Queueing networks are typically modelled assuming that the arrival process is exogenous, and unaffected by admission control, scheduling policies, etc. In many situations, however, users choose the time of their arrival strategically, taking delay and other metrics into account. In this paper, we develop a framework to study such strategic arrivals into queueing networks. We start by deriving a...
متن کاملQueueing for ergodic arrivals and services
In this paper we revisit the results of Loynes (1962) on stability of queues for ergodic arrivals and services, and show examples when the arrivals are bounded and ergodic, the service rate is constant, and under stability the limit distribution has larger than exponential tail. Dept. of Computer Science and Information Theory, Technical University of Budapest, 1521 Stoczek u. 2, Budapest, Hung...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2010
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s00186-010-0330-5